STABLE CLUSTERING ON AODV WITH SLEEP MODE

Clustering has evolved as an imperative research domain that enhances system performance such as throughput and delay in Mobile Ad hoc Networks (MANETs) in the presence of both mobility and a large number of mobile terminals. In this thesis, we present a clustering scheme that minimizes message overhead and congestion for cluster formation and maintenance. The algorithm is devised to be dependent on Ad-hoc On Demand Distance Vector (AODV) Routing with sleep mode algorithm of MANET. The dynamic formation of clusters helps reduce data packet overhead, node complexity and power consumption. The goal of this algorithm is to decrease the number of cluster forming, maintain stable clustering structure and maximize lifespan of mobile nodes in the system. Nodes in MANET networks are basically battery operated, and thus have access to a limited amount of energy. This process proposes an Energy based Ad-Hoc on-Demand Routing algorithm that balances energy among nodes so that a minimum energy level is maintained among nodes and the lifetime of network is increased. The simulation has been performed in ns-2. The simulation shows that the number of clusters formed is in proportion with the number of nodes in MANET

PERFORMANCE EVALUATION OF MODIFIED AODV AGAINST BLACK HOLE ATTACK IN MANET

A mobile ad-hoc network is an infrastructure less network which consists of a number of mobile nodes that dynamically form a temporary network for the transmission of data from source to destination. They are composed of nodes that relay on each other to manage and for secure transmission of traffic due to lack of centralized administration. As MANETs become widely used, the security issue has become one of the primary concerns for all the times. One of the well known attack is the Black Hole attack which is most common in the on-demand routing protocols such as AODV.In this paper, the proposed solution is to modify the AODV routing protocol in such a way that it can combat the cooperative Black Hole attack. The results show an effective increase in throughput and PDR and decrease in average end-to-end delay with a slight increase in routing overhead